翻訳と辞書 Words near each other ・ Complexe Guy-Favreau ・ Complexe Les Ailes ・ Complexe Maisonneuve ・ Complexe OCP ・ Complexe sonore ・ Completely Serious ・ Completely uniformizable space ・ Completely Well ・ Completely-S matrix ・ CompletelyNovel ・ Completement Nue Au Soleil ・ Completeness ・ Completeness (cryptography) ・ Completeness (knowledge bases) ・ Completeness (logic) ・ Completeness (order theory) ・ Completeness (statistics) ・ Completeness of atomic initial sequents ・ Completeness of the real numbers ・ Completer ・ CompleteTax ・ Completing the square ・ Completion ・ Completion (algebra) ・ Completion (American football) ・ Completion (oil and gas wells) ・ Completion guarantee ・ Completion rate ・ Completion stage ・ Completionist Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Completeness (order theory) ： ウィキペディア英語版 Completeness (order theory) In the mathematical area of order theory, completeness properties assert the existence of certain infima or suprema of a given partially ordered set (poset). The most familiar example is the completeness of the real numbers. A special use of the term refers to complete partial orders or complete lattices. However, many other interesting notions of completeness exist. The motivation for considering completeness properties derives from the great importance of suprema (least upper bounds, joins, "$\backslash vee$") and infima (greatest lower bounds, meets, "$\backslash wedge$") to the theory of partial orders. Finding a supremum means to single out one distinguished least element from the set of upper bounds. On the one hand, these special elements often embody certain concrete properties that are interesting for the given application (such as being the least common multiple of a set of numbers or the union of a collection of sets). On the other hand, the knowledge that certain types of subsets are guaranteed to have suprema or infima enables us to consider the computation of these elements as ''total operations'' on a partially ordered set. For this reason, posets with certain completeness properties can often be described as algebraic structures of a certain kind. In addition, studying the properties of the newly obtained operations yields further interesting subjects. ==Types of completeness properties== All completeness properties are described along a similar scheme: one describes a certain class of subsets of a partially ordered set that are required to have a supremum or infimum. Hence every completeness property has its dual, obtained by inverting the order-dependent definitions in the given statement. Some of the notions are usually not dualized while others may be self-dual (i.e. equivalent to their dual statements). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Completeness (order theory)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.